Optimal drug combinations and minimal hitting sets
نویسندگان
چکیده
منابع مشابه
Computing Minimal Hitting Sets with Genetic Algorithm
A set S that has a non-empty intersection with every set in a collection of sets C is called a hitting set of C. If no element can be removed from S without violating the hitting set property, S is considered to be minimal. Several interesting problems can be partly formulated as ones that a minimal hitting set or more ones have to be found. Many of these problems are required for proper soluti...
متن کاملAsymptotically Optimal Hitting Sets Against Polynomials
Our main result is an efficient construction of a hitting set generator against the class of polynomials of degree di in the i-th variable. The seed length of this generator is logD + O (̃logD). Here, logD = ∑ i log(di + 1) is a lower bound bound on the seed length of any hitting set generator against this class. Our construction is the first to achieve asymptotically optimal seed length for eve...
متن کاملOptimal Hitting Sets for Combinatorial Shapes
We consider the problem of constructing explicit Hitting sets for Combinatorial Shapes, a class of statistical tests first studied by Gopalan, Meka, Reingold, and Zuckerman (STOC 2011). These generalize many well-studied classes of tests, including symmetric functions and combinatorial rectangles. Generalizing results of Linial, Luby, Saks, and Zuckerman (Combinatorica 1997) and Rabani and Shpi...
متن کاملOptimizations for the Boolean Approach to Computing Minimal Hitting Sets
The Boolean approach to computing minimal hitting sets proposed by Lin and Jiang is known to offer very attractive general performance, but also has its issues, specifically with a cardinalityrestricted search. In this paper we propose optimizations regarding the refinement rules, also offering a revised decision strategy as well as optimized termination criteria that exploit cardinality bounds...
متن کاملAn Efficient Distributed Algorithm for Computing Minimal Hitting Sets
Computing minimal hitting sets for a collection of sets is an important problem in many domains (e.g., Spectrum-based Fault Localization). Being an NP-Hard problem, exhaustive algorithms are usually prohibitive for real-world, often large, problems. In practice, the usage of heuristic based approaches trade-off completeness for time efficiency. An example of such heuristic approaches is STACCAT...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Systems Biology
سال: 2009
ISSN: 1752-0509
DOI: 10.1186/1752-0509-3-81